A New VLSI Architecture for Full Search Block Matching

نویسندگان

  • Nuno Roma
  • Leonel Sousa
چکیده

A new efficient type I architecture for motion estimation in video sequences based on the Full-Search BlockMatching (FSBM) algorithm is proposed in this paper. This architecture presents minimum latency, maximum throughput and full utilization of the hardware resources, combining both pipelining and parallel processing techniques. The implementation of an array processor for motion estimation in a single-chip using CMOS technology is presented. Experimental results show that this processor is able to estimate motion vectors in 4CIF video sequences at a rate of 16 frames/s.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient VLSI Architecture for Full-Search Block Matching Algorithms

This paper presents a novel memory-based VLSI architecture for full search block matching algorithms. We propose a semi-systolic array to meet the requirements of high computational complexity, where data communications are handled in two styles: (1) global connections for search data and (2) local connections for partial sum. Data flow is handled by a multiple-port memory bank so that all proc...

متن کامل

A New Efficient VLSI Architecture for Full Search Block Matching Motion Estimation

A new efficient type I architecture for motion estimation in video sequences based on the Full-Search Block-Matching (FSBM) algorithm is proposed in this paper. This architecture presents minimum latency, maximum throughput and full utilization of the hardware resources, combining both pipelining and parallel processing techniques. The implementation of an array processor for motion estimation ...

متن کامل

New VLSI Architecture for Motion Estimation Algorithm

This paper presents an efficient VLSI architecture design to achieve real time video processing using Full-Search Block Matching (FSBM) algorithm. The design employs parallel bank architecture with minimum latency, maximum throughput, and full hardware utilization. We use nine parallel processors in our architecture and each controlled by a state machine. State machine control implementation ma...

متن کامل

Fast VLSI Implementation for Low Power Motion Estimation Removing Redundant Memory Data Access

| This paper presents a new VLSI architecture of the Motion Estimation in MPEG-2. Previously , a number of full search block matching algorithms (BMA) and architectures using systolic array have been proposed for motion estimation. However, the architectures have an ineeciently large number of external memory access. Recently, to reduce the number of accesses in one candidate block, a block mat...

متن کامل

An efficient and reconfigurable VLSI architecture for different block matching motion estimation algorithms

| This paper describes a VLSI architecture which can be recon gured to support both Full Search Block{Matching algorithm and 3{step Hierarchical Search Block{Matching algorithm. By using a recon gurable register{ mux array and a parameterizable adder tree, the 2{D array architecture provides e cient real time motion estimation for many video applications. We also propose a memory architecture a...

متن کامل

High Throughput and Cost Efficient VLSI Architecture of Integer Motion Estimation for H.264/AVC

Variable block size motion estimation (VBS-ME) is one of the contributors to H.264/AVC’s excellent coding efficiency. Due to its high computational complexity, however, VBS-ME needs acceleration for real-time high-resolution applications. This paper proposes a high throughput and cost efficient VLSI architecture for integer full-search VBS-ME in H.264/AVC. A new scan order is introduced to re-u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005